On super vertex-antimagic total labelings of disjoint union of paths
نویسندگان
چکیده
Let G = (V,E) be a (p, q)-graph of order p and size q and f be a bijection from the set V ∪ E to the set of the first p + q natural numbers. The weight of a vertex is the sum of its label and the labels of all adjacent edges. We say f is an (a, d)-vertex-antimagic total labeling if the vertex-weights form an arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In this paper, we study super (a, d)-vertex-antimagic total properties of disjoint union of paths.
منابع مشابه
On super antimagic total labeling of Harary graph
This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.
متن کاملSuper Magic and Antimagic Labelings of Disjoint Union of Plane Graphs
SUPER MAGIC AND ANTIMAGIC LABELINGS OF DISJOINT UNION OF PLANE GRAPHS Ali Ahmad, Martin Bača, Marcela Lascsáková, Andrea Semaničová-Feňovčíková 2,3 College of computer and information system, Jazan University, Jazan, Saudi Arabia Department of Appl. Mathematics and Informatics, Technical University, Košice, Slovak Republic Abdus Salam School of Mathematical Sciences, G. C. University, Lahore, P...
متن کاملOn super edge-antimagic total labelings of mKn
A graph G of order p and size q is called (a, d)-edge-antimagic total if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that the edge-weights w(uv) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic sequence with first term a and common difference d. The graph G is said to be super (a, d)-edge-antimagic total if the vertex labels are 1, 2, . . . , p. In this p...
متن کاملOn super d-antimagic labelings of disjoint union of prisms
We label the vertices, edges and faces by the consecutive integers from 1 to |V |+ |E|+ |F | in such a way that the label of a face and the labels of the vertices and edges surrounding that face all together add up to a weight of that face. These face weights then form an arithmetic progression with common difference d. In this paper we examine the existence of such labeling for a disjoint unio...
متن کاملOn vertex antimagicness of disjoint union of graphs
Let G = (V,E) be a graph of order n and size e. An (a, d)-vertexantimagic total labeling is a bijection α from V (G) ∪ E(G) onto the set of consecutive integers {1, 2, . . . , n + e}, such that the vertex-weights form an arithmetic progression with the initial term a and the common difference d. The vertex-weight of a vertex x is the sum of values α(xy) assigned to all edges xy incident to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010